Approximate Entropy of Brain Network in the Study of Hemispheric Differences

Human brain, a dynamic complex system, can be studied with different approaches, including linear and nonlinear ones. One of the nonlinear approaches widely used in electroencephalographic (EEG) analyses is the entropy, the measurement of disorder in a system. The present study investigates brain networks applying approximate entropy (ApEn) measure for assessing the hemispheric EEG differences; reproducibility and stability of ApEn data across separate recording sessions were evaluated. Twenty healthy adult volunteers were submitted to eyes-closed resting EEG recordings, for 80 recordings. Significant differences in the occipital region, with higher values of entropy in the left hemisphere than in the right one, show that the hemispheres become active with different intensities according to the performed function. Besides, the present methodology proved to be reproducible and stable, when carried out on relatively brief EEG epochs but also at a 1-week distance in a group of 36 subjects. Nonlinear approaches represent an interesting probe to study the dynamics of brain networks. ApEn technique might provide more insight into the pathophysiological processes underlying age-related brain disconnection as well as for monitoring the impact of pharmacological and rehabilitation treatments.     

An Improved Composite Multiscale Fuzzy Entropy for Feature Extraction of MI-EEG

Motor Imagery Electroencephalography (MI-EEG) has shown good prospects in neurorehabilitation, and the entropy-based nonlinear dynamic methods have been successfully applied to feature extraction of MI-EEG. Especially based on Multiscale Fuzzy Entropy (MFE), the fuzzy entropies of the τ coarse-grained sequences in τ scale are calculated and averaged to develop the Composite MFE (CMFE) with more feature information. However, the coarse-grained process fails to match the nonstationary characteristic of MI-EEG by a mean filtering algorithm. In this paper, CMFE is improved by assigning the different weight factors to the different sample points in the coarse-grained process, i.e., using the weighted mean filters instead of the original mean filters, which is conductive to signal filtering and feature extraction, and the resulting personalized Weighted CMFE (WCMFE) is more suitable to represent the nonstationary MI-EEG for different subjects. All the WCMFEs of multi-channel MI-EEG are fused in serial to construct the feature vector, which is evaluated by a back-propagation neural network. Based on a public dataset, extensive experiments are conducted, yielding a relatively higher classification accuracy by WCMFE, and the statistical significance is examined by two-sample t-test. The results suggest that WCMFE is superior to the other entropy-based and traditional feature extraction methods.     

The Application of Fractal Transform and Entropy for Improving Fault Tolerance and Load Balancing in Grid Computing Environments

This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate.     

Dynamical Analysis of a New Chaotic Fractional Discrete-Time System and Its Control

This article proposes a new fractional-order discrete-time chaotic system, without equilibria, included two quadratic nonlinearities terms. The dynamics of this system were experimentally investigated via bifurcation diagrams and largest Lyapunov exponent. Besides, some chaotic tests such as the 0–1 test and approximate entropy (ApEn) were included to detect the performance of our numerical results. Furthermore, a valid control method of stabilization is introduced to regulate the proposed system in such a way as to force all its states to adaptively tend toward the equilibrium point at zero. All theoretical findings in this work have been verified numerically using MATLAB software package.     

Small activation entropy bestows high-stability of nanoconfined D-mannitol

It has been a long-standing puzzling problem that some glasses exhibit higher glass transition temperatures(denoting high stability) but lower activation energy for relaxations(denoting low stability). In this paper, the relaxation kinetics of the nanoconfined D-mannitol(DM) glass was studied systematically using a high-precision and high-rate nanocalorimeter.The nanoconfined DM exhibits enhanced thermal stability compared to the free DM. For example, the critical cooling rate for glass formation decreases from 200 K/s to below 1 K/s; the Tg increases by about 20 K–50 K. The relaxation kinetics is analyzed based on the absolute reaction rate theory. It is found that, even though the activation energy E~*decreases,the activation entropy S~*decreases much more for the nanoconfined glass that yields a large activation free energy G~*and higher thermal stability. These results suggest that the activation entropy may provide new insights in understanding the abnormal kinetics of nanoconfined glassy systems.     

Compressibility of random walker trajectories on growing networks

We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible.     

一类改进最大熵方法的可调参数分析

在结构可靠性分析中,引入含可调参数的转换函数能对传统的最大熵方法进行改进,获得更高的失效概率预测精度。但是,此可调参数的最佳取值很难确定。针对这一问题,引入概率守恒方程,从功能函数转换前后所得概率密度函数出发,建立其最大熵值的变化关系,给出转换前后最大熵值之差的理论形式。通过对三种典型单调非线性转换函数开展算例研究,发现功能函数转换前后的最大熵值之差与转换函数的最佳可调参数值有关。改变可调参数值驱使最大熵值之差变化的同时,改进最大熵方法能遍历到更好的失效概率估计值。     

熵的一种通俗教法

熵如力、能量和动量一样是物理学中一个重要概念,若能用一种通俗易懂的方法设计熵的教学,对文科物理的教学有重要意义.为此本文提出了一种通俗的熵的教法,这一教法不需要学生学习热力学第二定律也可以建立熵的概念.具体教学设计如下:通过日常生活例子引入熵的概念(也就是玻尔兹曼熵),设计两个例子让学生会计算熵,通过具体问题的讨论让学生充分理解熵的意义,通过一个实例由玻尔兹曼熵引入克劳修斯熵公式,设计一个演示实验强化教学效果,将熵与环境保护联系起来融入人文情怀,最后还强调了熵计算的不同层次.教学设计完全采用基于问题学习(PBL)的教学模式.     

Semiotic Aggregation in Deep Learning

Convolutional neural networks utilize a hierarchy of neural network layers. The statistical aspects of information concentration in successive layers can bring an insight into the feature abstraction process. We analyze the saliency maps of these layers from the perspective of semiotics, also known as the study of signs and sign-using behavior. In computational semiotics, this aggregation operation (known as superization) is accompanied by a decrease of spatial entropy: signs are aggregated into supersign. Using spatial entropy, we compute the information content of the saliency maps and study the superization processes which take place between successive layers of the network. In our experiments, we visualize the superization process and show how the obtained knowledge can be used to explain the neural decision model. In addition, we attempt to optimize the architecture of the neural model employing a semiotic greedy technique. To the extent of our knowledge, this is the first application of computational semiotics in the analysis and interpretation of deep neural networks.